Quantum Certificate Verification: Single versus Multiple Quantum Certificates
نویسندگان
چکیده
The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languages that can be efficiently verified by quantum verifiers using a single quantum certificate. Suppose that a verifier receives not only one but multiple certificates. In the classical setting, it is obvious that a classical verifier with multiple classical certificates is essentially the same with the one with a single classical certificate. However, in the quantum setting where a quantum verifier is given a set of quantum certificates in tensor product form (i.e. each quantum certificate is not entangled with others), the situation is different, because the quantum verifier might utilize the structure of the tensor product form. This suggests a possibility of another hierarchy of complexity classes, namely the QMA hierarchy. From this point of view, we extend the definition of QMA to QMA(k) for the case quantum verifiers use k quantum certificates, and analyze the properties of QMA(k). To compare the power of QMA(2) with that of QMA(1) = QMA, we show one interesting property of “quantum indistinguishability”. This gives a strong evidence that QMA(2) is more powerful than QMA(1). Furthermore, we show that, for any fixed positive integer k ≥ 2, if a language L has a one-sided bounded error QMA(k) protocol with a quantum verifier using k quantum certificates, L necessarily has a one-sided bounded error QMA(2) protocol with a quantum verifier using only two quantum certificates.
منابع مشابه
Analytical Performance Evaluation of Nested Certificates
The classical certificate systems are computationally inefficient, since they use signature operations based on public key cryptosystems. The nested certificates (A. Levi, Design and performance evaluation of the nested certification scheme and its applications in public key infrastructures, Ph.D. Thesis, Department of Computer Engineering, Boğaziçi University, Istanbul, Turkey) are proposed to...
متن کاملVerification of classical certificates via nested certificates and nested certificate paths
Nested certificates are used to certify their subject certificates. In this way, the subject certificates can be verified via their nested certificates without using signature verification methods based on public key cryptosystems. Such a verification method is called as subject certificate verification. In this paper, subject certificate verification method will be introduced. It will be shown...
متن کاملDomain Based Certification and Revocation
Certificate Authorities (CAs) are considered as a single point of failure in the design of Public Key Infrastructure (PKI). Adversaries can take the advantage of a compromised CA to issue certificates for any domains without being noticed by the domain owners. Another argument regarding PKI is the adoption of Certificate Revocation List (CRL) and Online Certificate Status Protocol (OCSP) for pu...
متن کاملThe quantum query complexity of certification
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced nand formula. We show that the query complexity is Θ̃(d) for 0-certificates, and Θ̃(d) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is Õ(d). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum...
متن کاملEfficient Verification of Delegation in Distributed Group Membership Management
In ad-hoc networks and other highly distributed and decentralized environments, authorization certificates can be used to control access. Moreover, it is possible to delegate rights listed in the certificate to another users. Several such subsequent delegations build a chain of certificates. Chains of delegation certificates can improve the capability and manageability of systems. Distributed g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره quant-ph/0110006 شماره
صفحات -
تاریخ انتشار 2001